A Parallel Preconditioned Conjugate Gradient Package for Solving Sparse Linear Systems on a Cray Y-mp *
نویسندگان
چکیده
In this paper we discuss current activities at Cray Research to develop general-purpose, production-quality software for the eecient solution of sparse linear systems. In particular, we discuss our development of a package of iterative methods that includes Conjugate Gradient and related methods (GMRES, ORTHOMIN and others) along with several preconditioners (incomplete Cholesky and LU factorization and polynomial). Vector and parallel performance issues are discussed as well as package design. Also, benchmarks on a wide variety of real-life problems are presented to assess the robustness and performance of methods implemented in our software. For symmetric positive deenite problems, we also compare the performance of the preconditioned conjugate gradient code with our parallel implementation of the multifrontal method for sparse Cholesky factorization.
منابع مشابه
Vectorization of some block preconditioned conjugate gradient methods
The block preconditioned conjugate gradient methods are very effective to solve the linear systems arising from the discretization of elliptic PDE. Nevertheless, the solution of the linear system Ms = r, to get the preconditioned residual, is a 'bottleneck', on vector processors. In this paper, we show how to modify the algorithm, in order to get better performances, on such computers. Numerica...
متن کاملAn element-by-element preconditioned conjugate gradient method implemented on a vector computer
We consider the linear equation Ax = b where A is a sparse symmetric positive definite matrix arising from a finite element discretisation. We use the preconditioned conjugate gradient method to solve this equation, introducing an element-by-element preconditioner which is based on a Crout's decomposition of the element matrices and an element-by-element product of them. When the mesh is colour...
متن کاملEffects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations
The conjugate gradient (CG) algorithm is perhaps the best-known iterative technique for solving sparse linear systems that are symmetric and positive definite. For systems that are ill conditioned, it is often necessary to use a preconditioning technique. In this paper, we investigate the effects of various ordering and partitioning strategies on the performance of parallel CG and ILU(0) precon...
متن کاملMA 42 – A new frontal code for solving sparse unsymmetric systems
We describe the design, implementation, and performance of a frontal code for the solution of large sparse unsymmetric systems of linear equations. The resulting software package, MA42, is included in Release 11 of the Harwell Subroutine Library and is intended to supersede the earlier MA32 package. We discuss in detail design changes from the earlier code, indicating the way in which they aid ...
متن کاملSolving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991